A Henkin-style completeness proof for the pure implicational calculus.
نویسندگان
چکیده
منابع مشابه
A Henkin-Style Proof of Completeness for First-order Algebraizable Logics
This paper considers Henkin’s proof of completeness of classical first-order logic and extends its scope to the realm of algebraizable logics in the sense of Blok and Pigozzi. Given a propositional logic L (for which we only need to assume that it has an algebraic semantics L and a suitable disjunction) we axiomatize two natural firstorder extensions L∀ and L∀ and prove that the former is compl...
متن کاملHenkin on Completeness
The Completeness of Formal Systems is the title of the thesis that Henkin presented at Princenton in 1947, under the guiadance of Alonzo Church. His renowned results on completeness for both type theory and first order logic are part of his thesis. It is interesting to note that he obtained the proof of completeness of first order logic readapting the argument found for the theory of types. It ...
متن کاملComplexity Results of Subclasses of the Pure Implicational Calculus
About 50 years ago Lukasiewicz, Tarski, see 6, 4] and others studied the implicational calculus, i. e. the set PIF (pure implicational formulas) of those propositional formulas that are constructed exclusively from Boolean variables and the propositional implication ! as the only connective. Obviously this class of formulas is not able to represent all Boolean functions. While every formula in ...
متن کاملA Mechanical Proof of the Turing Completeness of Pure Lisp
We describe a proof by a computer program of the Turing completeness of a computational paradigm akin to Pure LISP. That is, we define formally the notions of a Turing machine and of a version of Pure LISP and prove that anything that can be computed by a Turing machine can be computed by LISP. While this result is straightforward, we believe this is the first instance of a machine proving the ...
متن کاملImplicational Completeness of Signed Resolution
1 Implicational completeness-a neglected topic Every serious computer scientist and logician knows that resolution is complete for rst-order clause logic. By this, of course, one means that the empty clause (representing contradiction) is derivable by resolution from every unsatissable set of clauses S. However, there is another { less well known { concept of completeness for clause logic, that...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1975
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1093891803